A hybrid algorithm for infinitely constrained optimization
نویسندگان
چکیده
منابع مشابه
A hybrid algorithm for infinitely constrained optimization
In® nitely constrained (or semi-in® nite) optimization can be successfully used to solve a signi® cant variety of optimization-based engineering design problems. In this paper a new algorithm for the numerical global solution of nonlinear and nonconvex, in® nitely constrained problems is proposed. At the upper level this hybrid algorithm is a partially elitist genetic algorithm that uses, at th...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملa new hybrid flower pollination algorithm for solving constrained global optimization problems
global optimization methods play an important role to solve many real-world problems. flower pollination algorithm (fp) is a new nature-inspired algorithm, based on the characteristics of flowering plants. in this paper, a new hybrid optimization method called hybrid flower pollination algorithm (fppso) is proposed. the method combines the standard flower pollination algorithm (fp) with the par...
متن کاملA Novel Hybrid Algorithm for Constrained Multi-objective Optimization
A new hybrid Optimization Algorithm is proposed to solve Constrained Multi-objective Optimization Problems (CMOPs). The algorithm is named BBO/DE which combines the exploitation ability of Biogeography-based Optimization (BBO) and the exploration ability of Differential Evolution (DE). Meanwhile distance measures and adaptive penalty functions are adopted to handle the constraints so that optim...
متن کاملA Hybrid Genetic Algorithm for Constrained Optimization Problems
Genetic algorithm (GA) is a powerful method to solve constrained optimization problems (COPs). In this paper, a new fitness function based hybrid genetic optimization algorithm (NFFHGA) for COPs is proposed, in which a new crossover operator based on Union Design is presented, and inspired by the smooth function technique, a new fitness function is designed to automatically search for potential...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Systems Science
سال: 2001
ISSN: 1464-5319,0020-7721
DOI: 10.1080/00207720150210878